Note on the game chromatic index of trees
نویسندگان
چکیده
We study edge coloring games defining the so-called game chromatic index of a graph. It has been reported that the game chromatic index of trees with maximum degree ∆ = 3 is at most ∆ + 1. We show that the same holds true in case ∆ ≥ 6, which would leave only the cases ∆ = 4 and ∆ = 5 open.
منابع مشابه
Edge Game Coloring of Graphs1
Corresponding to the game chromatic number of graphs, we consider in this paper the game chromatic index χg of graphs, which is defined similarly, except that edges, instead of vertices of graphs are colored. Upper bounds for trees and wheels are given.
متن کاملThe Game Chromatic Number of 1-Caterpillars
The game chromatic number of a graph is defined using a two players game. In 1993, Faigle et al. proved that the game chromatic number of trees is at most four. In this paper we investigate the problem of characterizing those trees with game chromatic number three, and setttle this problem for 1-caterpillars.
متن کاملJust chromatic exellence in fuzzy graphs
A fuzzy graph is a symmetric binary fuzzy relation on a fuzzy subset. The concept of fuzzy sets and fuzzy relations was introduced by L.A.Zadeh in 1965cite{zl} and further studiedcite{ka}. It was Rosenfeldcite{ra} who considered fuzzy relations on fuzzy sets and developed the theory of fuzzy graphs in 1975. The concepts of fuzzy trees, blocks, bridges and cut nodes in fuzzy graph has been studi...
متن کاملThe relaxed game chromatic index of k-degenerate graphs
The (r, d)-relaxed coloring game is a two-player game played on the vertex set of a graph G. We consider a natural analogue to this game on the edge set of G called the (r, d)-relaxed edge-coloring game. We consider this game on trees and more generally, on k-degenerate graphs. We show that if G is k-degenerate with (G) = , then the first player, Alice, has a winning strategy for this game with...
متن کاملPaths on Stern-Brocot Tree and Winding numbers of modes
The aim of this paper is to propose a natural definition of a winding number for a m-note mode, generalizing the concept of well formedness (proposed by Carey and Clampitt) providing and discussing some aspects regarding the Stern-Brocot trees. We start by giving an algebraic definition of a m-notes mode in a chromatic set of n elements as a composed map between Zm and Zn. Then we introduce the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 313 شماره
صفحات -
تاریخ انتشار 2004